Numerical studies of planar closed random walks
نویسنده
چکیده
Lattice numerical simulations for planar closed random walks and their winding sectors are presented. The frontiers of the random walks and of their winding sectors have a Hausdorff dimension dH = 4/3. However, when properly defined by taking into account the inner 0-winding sectors, the frontiers of the random walks have a Hausdorff dimension dH ≈ 1.77.
منابع مشابه
Numerical studies of planar closed random walks . Jean Desbois and Stéphane Ouvry April
Lattice numerical simulations for planar closed random walks and their winding sectors are presented. The frontiers of the random walks and of their winding sectors have a Hausdorff dimension dH = 4/3. However, when properly defined by taking into account the inner 0-winding sectors, the frontiers of the random walks have a Hausdorff dimension dH ≈ 1.77.
متن کاملThe linking number and the writhe of uniform random walks and polygons in confined spaces
Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the ...
متن کاملScaling of the average crossing number in equilateral random walks, knots and proteins
We compare here the scaling behaviour of the mean average crossing number 〈ACN〉 of equilateral random walks in linear and closed form with the corresponding scaling observed in natural protein trajectories. We have shown recently that the scaling of 〈ACN〉 of equilateral random walks of length n follows the relation 〈ACN〉 = 3 16 n ln n + bn and that a similar result holds for equilateral random ...
متن کاملBounds on the number of closed walks in a graph and its applications
Using graph-theoretical techniques, we establish an inequality regarding the number of walks and closed walks in a graph. This inequality yields several upper bounds for the number of closed walks in a graph in terms of the number of vertices, number of edges, maximum degree, degree sequence, and the Zagreb indices of the graph. As applications, we also present some new upper bounds on the Estr...
متن کاملPredicting Optimal Lengths of Random Knots
In thermally fluctuating long linear polymeric chain in solution, the ends come from time to time into a direct contact or a close vicinity of each other. At such an instance, the chain can be regarded as a closed one and thus will form a knot or rather a virtual knot. Several earlier studies of random knotting demonstrated that simpler knots show their highest occurrence for shorter random wal...
متن کامل